Path graph

Results: 1083



#Item
311CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Application of computational geometry to network p-center location problems Binay Bhattacharya

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:10:51
312CCCG 2011, Toronto ON, August 10–12, 2011  Euclidean Movement Minimization Nima Anari∗  MohammadAmin Fazli†

CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
313Complex Network Metrology Jean-Loup Guillaume Matthieu Latapy – CNRS – Université Paris 7, 2 place Jussieu, 75005 Paris, France

Complex Network Metrology Jean-Loup Guillaume Matthieu Latapy – CNRS – Université Paris 7, 2 place Jussieu, 75005 Paris, France

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:36:40
314Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 06:03:09
315CCCG 2009, Vancouver, BC, August 17–19, 2009  How to make a picturesque maze Yoshio Okamoto∗†  Abstract

CCCG 2009, Vancouver, BC, August 17–19, 2009 How to make a picturesque maze Yoshio Okamoto∗† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:33:29
316CCCG 2011, Toronto ON, August 10–12, 2011  Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:12
317Experiments on Area Compaction Algorithms for Orthogonal Drawings Carla Binucci †

Experiments on Area Compaction Algorithms for Orthogonal Drawings Carla Binucci †

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:53
318Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent

Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:54
319Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗

Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:08:28
320CCCG 2009, Vancouver, BC, August 17–19, 2009  On the Height of a Homotopy Erin W. Chambers∗  Abstract

CCCG 2009, Vancouver, BC, August 17–19, 2009 On the Height of a Homotopy Erin W. Chambers∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:32:43